Breaking DES
نویسنده
چکیده
John Gilmore of the Electronic Frontier Foundation (EFF) and I had several discussions in early 1997 about actually building such a machine. Approaches using FPGAs, microprocessor arrays, and networks of low-cost PCs were prohibitively expensive, but our projections showed that low-volume ASIC fabrication processes were well-suited to the task. John then arranged $250,000 in financing for the project from the EFF a significant feat. My company, Cryptography Research, donated time for the system architecture design, chip emulator, and control software implementation. We contracted with AWT, a chip design company, to build the machine, while John provided project leadership. Our final budget included $80,000 for AWT’s labor and $130,000 for chip fabrication and other materials.
منابع مشابه
Breaking DES using a molecular computer
Recently Adleman has shown that a small traveling salesman problem can be solved by molecular operations. In this paper we show how the same principles can be applied to breaking the Data Encryption Standard (DES). We describe in detail a library of operations which are useful when working with a molecular computer. We estimate that given one arbitrary (plain-text, cipher-text) pair, one can re...
متن کاملStability of the Mezard-Parisi solution for random manifolds
The eigenvalues of the Hessian associated with random manifolds are constructed for the general case of R steps of replica symmetry breaking. For the Parisi limit R → ∞ (continuum replica symmetry breaking) which is relevant for the manifold dimension D < 2, they are shown to be non negative. Resumé Les valeurs propres de la Hessienne, associée avec une varieté aleatoire, sont construites dans ...
متن کاملSimulation of breaking wave by SPH method coupled with k– model Simulation des vagues déferlantes par la méthode SPH couplée à un modèle k–
The paper employs a Reynolds-averaged Navier–Stokes (RANS) approach to investigate the time-dependent wave breaking processes. The numerical model is the smoothed particle hydrodynamic (SPH) method. It is a mesh-free particle approach which is capable of tracking the free surfaces of large deformation in an easy and accurate way. The widely used two-equation k–εmodel is chosen as the turbulence...
متن کاملApplication of PVM to Linear Cryptanalysis of DES
Data Encryption Standard (DES) is the most widely used cryptographic algorithm. Recently, Matsui 8] showed that the algorithm is not secure under a plaintext attack, called linear cryptanalysis. In this paper we show that this attack can be implemented as a concurrent program and hence the required time for breaking DES can be eeectively reduced by employing a parallel computing environment.
متن کاملFeistel-type Block Cipher by Bacteria Engineering
In this paper we propose a theoretical method for breaking a block cipher based on a Feistel structure which is a variant of DES (S-DES) using one pair of (plaintext, ciphertext). Our scheme utilizes bacterial computing for the first time in cryptanalysis. For this reason, we design and simulate an engineered gene regulatory network to break S-DES which possesses a superior performance than the...
متن کاملGPGPU Acceleration of Cryptographic Applications
Cryptographic algorithms are crucial to the security of modern computing systems. The peculiar nature of such algorithms leads them to be computationally intensive by design. Speeding up cryptographic algorithms through parallelization can therefore prove effective especially when large amount of data are to be encrypted. At the same time, massive amounts of SIMD-like parallel computational pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999